Rough operations on Boolean algebras
نویسندگان
چکیده
In this paper, we introduce two pairs of rough operations on Boolean algebras. First we define a pair of rough approximations based on a partition of the unity of a Boolean algebra. We then propose a pair of generalized rough approximations on Boolean algebras after defining a basic assignment function between two different Boolean algebras. Finally, some discussions on the relationship between rough operations and some uncertainty measures are given to provide a better understanding of both rough operations and uncertainty measures on Boolean algebras.
منابع مشابه
A Logic for Rough Sets
The collection of all subsets of a set forms a Boolean algebra under the usual set theoretic operations, while the collection of rough sets of an approximation space is a regular double Stone algebra [24]. The appropriate class of algebras for classical propositional logic are Boolean algebras, and it is reasonable to assume that regular double Stone algebras are a class of algebras appropriate...
متن کاملHeyting algebras with Boolean operators for rough sets and information retrieval applications
This paper presents an algebraic formalism for reasoning on finite increasing sequences over Boolean algebras in general and on generalizations of Rough Set concepts in particular. We argue that these generalizations are suitable for modeling relevance of documents in an Information Retrieval system.
متن کاملOn Connections between Information Systems, Rough Sets and Algebraic Logic
In this note we remark upon some relationships between the ideas of an approximation space and rough sets due to Pawlak ([9] and [10]) and algebras related to the study of algebraic logic — namely, cylindric algebras, relation algebras, and Stone algebras. The paper consists of three separate observations. The first deals with the family of approximation spaces induced by the indiscernability r...
متن کاملRough relation algebras1,2
Rough relation algebras were introduced by S. Comer as a generalisation of algebras of Pawlak's rough sets and Tarski's relation algebras. In this paper, some algebraic and arithmetical properties of rough relation algebras are studied and the representable rough relation algebras are characterised. 1. Definitions and preliminary results We assume that the reader is familiar with the basic fact...
متن کاملFilter theory in MTL-algebras based on Uni-soft property
The notion of (Boolean) uni-soft filters in MTL-algebras is introduced, and several properties of them are investigated. Characterizations of (Boolean) uni-soft filters are discussed, and some (necessary and sufficient) conditions for a uni-soft filter to be Boolean are provided. The condensational property for a Boolean uni-soft filter is established.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Sci.
دوره 173 شماره
صفحات -
تاریخ انتشار 2005